1477C - Nezzar and Nice Beatmap - CodeForces Solution


constructive algorithms geometry greedy math sortings *2200

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int sign_dot(int x1, int y1, int x2, int y2) {
    long long dot_prod = (long long) x1 * x2 + (long long) y1 * y2;
    if (dot_prod < 0) {
        return -1;
    } else if (dot_prod == 0) {
        return 0;
    } else {
        return 1;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin >> n;
    int x[n];
    int y[n];
    int p[n];
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
        p[i] = i + 1;
    }

    for (int i = 1; i < n - 1; i++) {
        for (int j = i; j >= 1; j--) {
            int x1 = x[j] - x[j - 1];
            int y1 = y[j] - y[j - 1];
            int x2 = x[j + 1] - x[j];
            int y2 = y[j + 1] - y[j];
            if (sign_dot(-x1, -y1, x2, y2) <= 0) {
                swap(x[j], x[j + 1]);
                swap(y[j], y[j + 1]);
                swap(p[j], p[j + 1]);
            }
        }
    }

    for (int i = 0; i < n; i++) {
        cout << p[i] << " ";
    }
    cout << endl;
}


Comments

Submit
0 Comments
More Questions

519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate